Dimensionality Reduction Method for the Output Regulation of Boolean Control Networks.

This article proposes a dimensionality reduction approach to study the output regulation problem (ORP) of Boolean control networks (BCNs), which has much lower computational complexity than previous results. First, an auxiliary system which is much smaller in scale than the augmented system in previous approach is constructed. By analyzing the set stabilization of the auxiliary system as well as the original BCN, a necessary and sufficient condition to detect the solvability of the ORP is presented. Second, a method to design the state feedback controls for the ORP is proposed. Finally, two biological examples are given to demonstrate the effectiveness and advantage of the obtained new results.

Identification of Boolean control networks with time delay.

This paper investigates the identification of time-delay Boolean networks (TBNs) and time-delay Boolean control networks (TBCNs) via Cheng product. According to all admissible (input-)output sequences, definition on identifiability of the (TBCN) TBN is given. Two algorithms are designed to select suitable delay parameters of the TBN and TBCN, respectively. Based on these, the original systems are divided into several subsystems. Then by virtue of observability, the criteria for identifiability of the TBN and TBCN are obtained. Moreover, the corresponding constructing processes are presented to establish the internal structures of the TBN and TBCN. Finally, two illustrative examples are given to show the feasibility of the proposed methods.

Reachability of dimension-bounded linear systems.

In this paper, the reachability of dimension-bounded linear systems is investigated. Since state dimensions of dimension-bounded linear systems vary with time, the expression of state dimension at each time is provided. A method for judging the reachability of a given vector space $ \mathcal{V}_{r} $ is proposed. In addition, this paper proves that the $ t $-step reachable subset is a linear space, and gives a computing method. The $ t $-step reachability of a given state is verified via a rank condition. Furthermore, annihilator polynomials are discussed and employed to illustrate the relationship between the invariant space and the reachable subset after the invariant time point $ t^{\ast} $. The inclusion relation between reachable subsets at times $ t^{\ast}+i $ and $ t^{\ast}+j $ is shown via an example.

Pinning Controller Design for Set Reachability of State-Dependent Impulsive Boolean Networks.

Considered the stimulation of tumor necrosis factor as an impulsive control, an apoptosis network is modeled as a state-dependent impulsive Boolean network (SDIBN). Making cell death normally means driving the trajectory of an apoptosis network out of states that indicate cell survival. To achieve the goal, this article focuses on the pinning controller design for set reachability of SDIBNs. To begin with, the definitions of reachability and set reachability are introduced, and their relation is illustrated. For judging whether the trajectory of an SDIBN leaves undesirable states, a necessary and sufficient condition is presented according to the criteria for the set reachability. In addition, a series of algorithms is provided to find all possible sets of pinning nodes for the set reachability. Note that attractors containing in all undesirable states are studied to make SDIBNs set reachable via controlling the smallest states. For the purpose of determining pinning nodes for one-step set reachability, the Hamming distance is presented under scalar forms of states. Pinning nodes with the smallest cardinality for the set reachability are derived by deleting some redundant nodes. Compared with the existing results, the state feedback gain can be obtained without solving logical matrix equations. The computation complexity of the proposed approach is lower than that of the existing methods. Moreover, the method of designing pinning controllers is used to discuss apoptosis networks. The experimental result shows that apoptosis networks depart from undesirable states by controlling only one node.

Stability and Guaranteed Cost Analysis of Time-Triggered Boolean Networks.

This paper investigates stability and guaranteed cost of time-triggered Boolean networks (BNs) based on the semitensor product of matrices. The time triggering is generated by mode-dependent average dwell-time switching signals in the BNs. With the help of the copositive Lyapunov function, a sufficient condition is derived to ensure that the considered network is globally stable under a designed average dwell-time switching signal. Subsequently, an infinite time cost function is further discussed and its bound is presented according to the obtained stability result. Numerical examples are finally given to show the feasibility of the theoretical results.